#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
#define rep(i, a, b) for (int i = (a); i <= (b); i++)
#define per(i, a, b) for (int i = (a); i >= (b); i--)
#define endl '\n'
const int N = 105;
const double eps = 1e-6;
int n, m;
double a[N][N];

bool gauss() {
  rep(i, 1, n) {
    // select row
    int r = i;
    rep(j, i, n) if (abs(a[j][i]) > abs(a[r][i])) r = j;
    if (abs(a[r][i]) < eps) return false;

    // swap row
    if (r != i) rep(j, 1, n + 1) swap(a[i][j], a[r][j]);

    // normalization
    double x = a[i][i];
    rep(j, 1, n + 1) a[i][j] = a[i][j] / x;
    // abstraction
    rep(j, 1, n) {
      if (j == i) continue;
      x = a[j][i];
      rep(k, 1, n + 1) a[j][k] -= x * a[i][k];
    }
  }
  return true;
}
int main() {
  ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  cin >> n;
  rep(i, 1, n) rep(j, 1, n + 1) cin >> a[i][j];
  if (gauss())
    rep(i, 1, n) cout << fixed << setprecision(2) << a[i][n + 1] << endl;
  else
    cout << "No Solution";

  return 0;
}